Packing Rectangles into 2OPT Bins Using Rotations
نویسندگان
چکیده
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles can be rotated by 90 degrees and have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.
منابع مشابه
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.
متن کاملUsing Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...
متن کاملTwo-dimensional bin packing with one-dimensional resource augmentation
The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...
متن کاملBin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the following packing problem: Given a collection of d-dimensional rectangles of specified sizes, pack them into the minimum number of unit cubes. We show that unlike the one-dimensional case, the two-dimensional packing problem cannot have an asymptotic polynomial time approximation scheme (APTAS), unless P = NP . On the positive side, we give an APTAS for the special case of packing ...
متن کاملAbsolute approximation ratios for packing rectangles into bins
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an algorithm with an absolute worst-case ratio of 2 for the case where the rectangles can be rotated by 90 degrees. This is optimal provided P 6= NP. For the case whe...
متن کامل